Word Problems on Compressed Words
نویسنده
چکیده
Motivation In general, computational problems become harder, when inputs are represented in a compressed form. Motivation In general, computational problems become harder, when inputs are represented in a compressed form. • Develop efficient algorithms on compressed data (strings, trees, pictures) that operate directly on compressed data without decompressing them first. • Prove lower bounds on compressed variants of computational problems.
منابع مشابه
Word Problems and Membership Problems on Compressed Words
We consider a compressed form of the word problem for finitely presented monoids, where the input consists of two compressed representations of words over the generators of a monoid M, and we ask whether these two words represent the same monoid element of M. Words are compressed using straight-line programs, i.e., context-free grammars that generate exactly one word. For several classes of fin...
متن کاملInfinite Smooth Lyndon Words
Motivation Outline Notation Lyndon words Smooth words Result Idea of the proof Case a) Case b) Case c) Case d) Open problems Motivation ◮ Lyndon words : class of words having lexicographical order properties. ◮ Smooth words : class of words, related to the Kolakoski word, that can be easily compressed. ◮ Some infinite smooth words are also Lyndon words.
متن کاملMatching of Compressed Patterns with Character-Variables
We consider the problem of finding an instance of a string-pattern s in a given string under compression by straight line programs (SLP). The variables of the string pattern can be instantiated by single characters. This is a generalisation of the fully compressed pattern match, which is the task of finding a compressed string in another compressed string, which is known to have a polynomial ti...
متن کاملThe Maximal Number of Runs in Standard Sturmian Words
We investigate some repetition problems for a very special class S of strings called the standard Sturmian words, which have very compact representations in terms of sequences of integers. Usually the size of this word is exponential with respect to the size of its integer sequence, hence we are dealing with repetition problems in compressed strings. An explicit formula is given for the number ...
متن کاملCompressed Word Problems for Inverse Monoids
The compressed word problem for a finitely generated monoid M asks whether two given compressed words over the generators of M represent the same element of M . For string compression, straight-line programs, i.e., contextfree grammars that generate a single string, are used in this paper. It is shown that the compressed word problem for a free inverse monoid of finite rank at least two is comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004